On Computational Complexity of Clifford Algebra
نویسنده
چکیده
After a brief discussion of the computational complexity of Clifford algebras, we present a new basis for even Clifford algebra Cl 2m that simplifies greatly the actual calculations and, without resorting to the conventional matrix isomorphism formulation, obtains the same complexity. In the last part we apply these results to the Clifford algebra formulation of the NP-complete problem of the maximum clique of a graph introduced by Budinich and Budinich “A spinorial formulation of the maximum clique problem of a graph,” J. Math. Phys. 47, 043502 2006 . © 2009 American Institute of Physics. DOI: 10.1063/1.3133042
منابع مشابه
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra generated by a set of pairs, and determining whether a given algebra is simple or subdirectly irreducible. We also consider the problem of determining the smallest fully invariant congruence on a given algebra containing...
متن کاملDerivations on Certain Semigroup Algebras
In the present paper we give a partially negative answer to a conjecture of Ghahramani, Runde and Willis. We also discuss the derivation problem for both foundation semigroup algebras and Clifford semigroup algebras. In particular, we prove that if S is a topological Clifford semigroup for which Es is finite, then H1(M(S),M(S))={0}.
متن کاملClifford Wavelets and Clifford-valued MRAs
In this paper using the Clifford algebra over R4 and its matrix representation, we construct Clifford scaling functions and Clifford wavelets. Then we compute related mask functions and filters, which arise in many applications such as quantum mechanics.
متن کاملSparse Representations of Clifford and Tensor algebras in Maxima
Clifford algebras have broad applications in science and engineering. The use of Clifford algebras can be further promoted in these fields by availability of computational tools that automate tedious routine calculations. We offer an extensive demonstration of the applications of Clifford algebras in electromagnetism using the geometric algebra G ≡ Cl3,0 as a computational model in the Maxima c...
متن کاملReductions in computational complexity using Clifford algebras
A number of combinatorial problems are treated using properties of abelian nilpotentand idempotent-generated subalgebras of Clifford algebras. For example, the problem of deciding whether or not a graph contains a Hamiltonian cycle is known to be NP-complete. By considering entries of Λ, where Λ is an appropriate nilpotent adjacency matrix, the k-cycles in any finite graph are recovered. Within...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0904.0417 شماره
صفحات -
تاریخ انتشار 2009